TSTP Solution File: SWV447^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SWV447^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 20:12:47 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 19 unt; 4 typ; 0 def)
% Number of atoms : 49 ( 32 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 106 ( 2 ~; 0 |; 0 &; 104 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 7 ^ 25 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cons,type,
cons: $i > $i > $i ).
thf(tp_map,type,
map: ( $i > $i ) > $i > $i ).
thf(tp_nil,type,
nil: $i ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(1,axiom,
! [F: $i > $i,X: $i,Y: $i] :
( ( map @ F @ ( cons @ X @ Y ) )
= ( cons @ ( F @ X ) @ ( map @ F @ Y ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
thf(2,axiom,
! [F: $i > $i] :
( ( map @ F @ nil )
= nil ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
thf(3,conjecture,
! [A: $i] :
( ( map
@ ^ [X: $i] : X
@ ( cons @ A @ nil ) )
= ( cons @ A @ nil ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test) ).
thf(4,negated_conjecture,
( ( ! [A: $i] :
( ( map
@ ^ [X: $i] : X
@ ( cons @ A @ nil ) )
= ( cons @ A @ nil ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,plain,
( ( ! [A: $i] :
( ( map
@ ^ [X: $i] : X
@ ( cons @ A @ nil ) )
= ( cons @ A @ nil ) ) )
= $false ),
inference(unfold_def,[status(thm)],[4]) ).
thf(6,plain,
( ( ! [F: $i > $i,X: $i,Y: $i] :
( ( map @ F @ ( cons @ X @ Y ) )
= ( cons @ ( F @ X ) @ ( map @ F @ Y ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( ! [F: $i > $i] :
( ( map @ F @ nil )
= nil ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(8,plain,
( ( ( map
@ ^ [X: $i] : X
@ ( cons @ sK1_A @ nil ) )
= ( cons @ sK1_A @ nil ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[5]) ).
thf(9,plain,
( ( ( ( map
@ ^ [X: $i] : X
@ ( cons @ sK1_A @ nil ) )
!= ( cons @ sK1_A @ nil ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [F: $i > $i] :
( ( map @ F @ nil )
= nil ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ! [F: $i > $i,X: $i,Y: $i] :
( ( map @ F @ ( cons @ X @ Y ) )
= ( cons @ ( F @ X ) @ ( map @ F @ Y ) ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(12,plain,
( ( ( ( map
@ ^ [X: $i] : X
@ ( cons @ sK1_A @ nil ) )
!= ( cons @ sK1_A @ nil ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(13,plain,
! [SV1: $i > $i] :
( ( ( map @ SV1 @ nil )
= nil )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(14,plain,
! [SV2: $i > $i] :
( ( ! [SY7: $i,SY8: $i] :
( ( map @ SV2 @ ( cons @ SY7 @ SY8 ) )
= ( cons @ ( SV2 @ SY7 ) @ ( map @ SV2 @ SY8 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(15,plain,
( ( ( map
@ ^ [X: $i] : X
@ ( cons @ sK1_A @ nil ) )
= ( cons @ sK1_A @ nil ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(16,plain,
! [SV3: $i,SV2: $i > $i] :
( ( ! [SY9: $i] :
( ( map @ SV2 @ ( cons @ SV3 @ SY9 ) )
= ( cons @ ( SV2 @ SV3 ) @ ( map @ SV2 @ SY9 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(17,plain,
! [SV4: $i,SV3: $i,SV2: $i > $i] :
( ( ( map @ SV2 @ ( cons @ SV3 @ SV4 ) )
= ( cons @ ( SV2 @ SV3 ) @ ( map @ SV2 @ SV4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(18,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[13,17,15]) ).
thf(19,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV447^1 : TPTP v8.1.0. Released v3.7.0.
% 0.12/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 18:21:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35
% 0.12/0.35 No.of.Axioms: 2
% 0.12/0.35
% 0.12/0.35 Length.of.Defs: 0
% 0.12/0.35
% 0.12/0.35 Contains.Choice.Funs: false
% 0.12/0.35 (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:4,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.20/0.38 ********************************
% 0.20/0.38 * All subproblems solved! *
% 0.20/0.38 ********************************
% 0.20/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:18,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.38
% 0.20/0.38 %**** Beginning of derivation protocol ****
% 0.20/0.38 % SZS output start CNFRefutation
% See solution above
% 0.20/0.38
% 0.20/0.38 %**** End of derivation protocol ****
% 0.20/0.38 %**** no. of clauses in derivation: 19 ****
% 0.20/0.38 %**** clause counter: 18 ****
% 0.20/0.38
% 0.20/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:18,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------